package com.gitee.ed.arithmetic.leetcode.solution.solution_1_100.solution_1_10;

import com.gitee.ed.arithmetic.leetcode.common.Solution;

/**
 * @author hongda.li
 */
public interface Solution3 extends Solution {
    /**
     * 计算最长重复子串
     *
     * @param s 待计算字符串
     * @return 最长重复字串
     */
    int lengthOfLongestSubstring(String s);
}
